Blind Collective Signature Protocol Based on Discrete Logarithm Problem
نویسندگان
چکیده
Using Schnorr’s digital signature (DS) scheme as the underlying scheme there is designed the collective DS protocol. In the proposed collective DS protocol the signature is formed simultaneously by all signers, therefore using this protocol leads to natural solution of the problem of signing simultaneously a contract. Using the proposed collective DS protocol the blind collective DS protocol has been designed, which is a new type of the multi-signature schemes. For simultaneous signing a package of different contracts by different sets of signers it is proposed another new multi-signature scheme called composite signature.
منابع مشابه
The new protocol blind digital signature based on the discrete logarithm problem on elliptic curve
In recent years it has been trying that with regard to the question of computational complexity of discrete logarithm more strength and less in the elliptic curve than other hard issues, applications such as elliptic curve cryptography, a blind digital signature method, other methods such as encryption replacement DLP. In this paper, a new blind digital signature scheme based on elliptic curve...
متن کاملAn efficient blind signature scheme based on the elliptic curve discrete logarithm problem
Elliptic Curve Cryptosystems (ECC) have recently received significant attention by researchers due to their high performance such as low computational cost and small key size. In this paper a novel untraceable blind signature scheme is presented. Since the security of proposed method is based on difficulty of solving discrete logarithm over an elliptic curve, performance of the proposed scheme ...
متن کاملDouble voter perceptible blind signature based electronic voting protocol
Mu et al. have proposed an electronic voting protocol and claimed that it protects anonymity of voters, detects double voting and authenticates eligible voters. It has been shown that it does not protect voter's privacy and prevent double voting. After that, several schemes have been presented to fulfill these properties. However, many of them suffer from the same weaknesses. In this p...
متن کاملNew Provably Secure Blind Signature Scheme with Weil Pairing
-------------------------------------------------------------------ABSTRACT-----------------------------------------------------Blind signature scheme provide the feature that a user is able to get a signature without giving the actual message to the signer. Many Blind signature schemes have been proposed in which security are based on intractability of factoring or DLP (Discrete Logarithm Prob...
متن کاملA new blind signature based on the discrete logarithm problem for untraceability
How to design a blind signature based on the discrete logarithm for untraceability is still a field in need of cultivation. In this article, we shall propose a new blind signature based on the discrete logarithm problem.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- I. J. Network Security
دوره 11 شماره
صفحات -
تاریخ انتشار 2010